The mouse Set conjecture for Sets of Reals
نویسندگان
چکیده
We show that the Mouse Set Conjecture for sets of reals is true in the minimal model of ADR + “Θ is regular”. As a consequence, we get that below ADR + “Θ is regular”, models of AD + +¬ADR are hybrid mice over R. Such a representation of models of AD+ is important in core model induction applications. One of the central open problems in descriptive inner model theory is the conjecture known as the Mouse Set Conjecture (MSC). It conjectures that under AD ∗2000 Mathematics Subject Classifications: 03E15, 03E45, 03E60. †
منابع مشابه
Frankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملDerived Models Associated to Mice
Sections 1–5. Introduction. Preliminary definitions and background material. The iteration independence of the derived model associated to a mouse. The mouse set conjecture in derived models associated to mice. Sections 6–8 The Solovay sequence in derived models associated to mice. A method of “translating away” extenders overlapping Woodin cardinals in mice. Sections 9–14. Some partial results...
متن کاملThe γ-Borel conjecture
In this paper we prove that it is consistent that every γ-set is countable while not every strong measure zero set is countable. We also show that it is consistent that every strong γ-set is countable while not every γ-set is countable. On the other hand we show that every strong measure zero set is countable iff every set with the Rothberger property is countable. A set of realsX has strong me...
متن کاملRemarks on Small Sets of Reals
We show that the Dual Borel Conjecture implies that d > א1 and find some topological characterizations of perfectly meager and universally meager sets.
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 80 شماره
صفحات -
تاریخ انتشار 2015